Optimizing Latin hypercube designs by particle swarm

نویسندگان

  • Ray-Bing Chen
  • Dai-Ni Hsieh
  • Ying Hung
  • Weichung Wang
چکیده

Latin hypercube designs (LHDs) are widely used in many applications. As the number of design points or factors becomes large, the total number of LHDs grows exponentially. The large number of feasible designs makes the search for optimal LHDs a difficult discrete optimization problem. To tackle this problem, we propose a new population-based algorithm named LaPSO that is adapted from the standard particle swarm optimization (PSO) and customized for LHD. Moreover, we accelerate LaPSO via a graphic processing unit (GPU). According to extensive comparisons, the proposed LaPSO is more stable than existing approaches and is capable of improving known results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

USING LATIN HYPERCUBE SAMPLING BASED ON THE ANN-HPSOGA MODEL FOR ESTIMATION OF THE CREATION PROBABILITY OF DAMAGED ZONE AROUND UNDERGROUND SPACES

The excavation damaged zone (EDZ) can be defined as a rock zone where the rock properties and conditions have been changed due to the processes related to an excavation. This zone affects the behavior of rock mass surrounding the construction that reduces the stability and safety factor and increase probability of failure of the structure. In this paper, a methodology was examined for computing...

متن کامل

A hierarchical particle swarm optimizer with latin sampling based memetic algorithm for numerical optimization

Memetic algorithms, one type of algorithms inspired by nature, have been successfully applied to solve numerous optimization problems in diverse fields. In this paper, we propose a new memetic computing model, using a hierarchical particle swarm optimizer (HPSO) and latin hypercube sampling (LHS) method. In the bottom layer of hierarchical PSO, several swarms evolve in parallel to avoid being t...

متن کامل

Optimal orthogonal-array-based latin hypercubes

 The use of optimal orthogonal array latin hypercube designs is proposed. Orthogonal arrays were proposed for constructing latin hypercube designs by Tang (1993). Such designs generally have better space filling properties than random latin hypercube designs. Even so, these designs do not necessarily fill the space particularly well. As a result, we consider orthogonal-array-based latin...

متن کامل

A note on orthogonal Latin hypercubes

Latin hypercube designs have been found very useful for designing computer experiments. In recent years, several methods of constructing orthogonal Latin hypercube designs have been proposed in the literature. In this article, we report some more results on Latin hypercube designs, including several new designs.

متن کامل

Two-dimensional minimax Latin hypercube designs

We investigate minimax Latin hypercube designs in two dimensions for several distance measures. For the `-distance we are able to construct minimax Latin hypercube designs of n points, and to determine the minimal covering radius, for all n. For the `1-distance we have a lower bound for the covering radius, and a construction of minimax Latin hypercube designs for (infinitely) many values of n....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Statistics and Computing

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2013